Pattern Detection Feedback Loop for Spatial and Temporal Memory Systems

ABSTRACT

A spatial and temporal memory system (STMS) processes input data to detect whether spatial patterns and/or temporal sequences of spatial patterns exist within the data, and to make predictions about future data. The data processed by the STMS may be retrieved from, for example, one or more database fields and is encoded into a distributed representation format using a coding scheme. The performance of the STMS in predicting future data is evaluated for the coding scheme used to process the data as performance data. The selection and prioritization of STMS experiments to perform may be based on the performance data for an experiment. The best fields, encodings, and time aggregations for generating predictions can be determined by an automated search and evaluation of multiple STMS systems.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of co-pending U.S. application Ser.No. 13/218,202, filed Aug. 25, 2011, which is incorporated by referenceherein in its entirety.

This application is also related to U.S. patent application Ser. No.13/218,170, entitled “Encoding of Data for Processing in A Spatial andTemporal Memory System”, filed Aug. 25, 2011; U.S. patent applicationSer. No. 13/218,194, entitled “Automated Search for Detecting PatternsAnd Sequences in Data Using A Spatial and Temporal Memory System”, filedAug. 25, 2011; and U.S. patent application Ser. No. 13/046,464, entitled“Temporal Memory Using Sparse Distributed Representation”, filed Mar.11, 2011. All of the foregoing applications are incorporated herein intheir entirety by reference for all purposes.

BACKGROUND

1. Field of the Disclosure

The present invention relates to spatial and temporal memory systemprocessing, and more specifically to automatically searching for spatialpatterns and temporal sequences of spatial patterns using multipleconfigurations of a machine learning system.

2. Description of the Related Arts

Predictive analytics refers to a variety of techniques for modeling anddata mining current and past data sets to make predictions. Predictiveanalytics allows for the generation of predictive models by identifyingpatterns in the data sets. Generally, the predictive models establishrelationships or correlations between various data fields in the datasets. Using the predictive models, a user can predict the outcome orcharacteristics of a transaction or event based on available data. Forexample, predictive models for credit scoring in financial servicesfactor in a customer's credit history and data to predict the likelinessthat the customer will default on a loan.

Commercially available products for predictive analytics includeproducts from IBM SSPS, KXEN, FICO, TIBCO, Portrait, Angoss, andPredixion Software, just to name a few. These software products use oneor more statistical techniques such as regression models, discretechoice models, time series models and other machine learning techniquesto generate useful predictive models. However, most of these softwareproducts are complex to use, often requiring weeks of training,mathematical expertise and complex data management. Hence, generating auseful predictive model is a daunting and expensive task for manyenterprises.

Most predictive analytics products come with a toolbox of mathematicaltechniques that the user can choose to apply to the data sets. Dependingon which techniques the user applies and how the data sets are encoded,these predictive analytic products may or may not yield use predictions.Determining the techniques to apply and the coding scheme used by amachine learning system is important to optimize the effectiveness ofthe machine learning system.

SUMMARY

Embodiments relate to a method and system for encoding data. Data isretrieved from one or more fields of data in one or more data sources,such as a database. The data in each field is encoded into a distributedrepresentation format. Spatial patterns and temporal sequences ofspatial patterns in the encoded input data may be identified by aspatial and temporal memory system's processing node. Predictions offuture spatial patterns in the encoded input data may be made by thespatial and temporal memory system based on the identified spatialpatterns and temporal sequences of spatial patterns in the encoded inputdata.

Embodiments relate to a method and system for evaluating the predictiveperformance of a spatial and temporal memory system. A spatial andtemporal memory system output is generated in response to receivinginput data representing a spatial pattern at a first time. The spatialand temporal memory system output includes a prediction of input datarepresenting a spatial pattern at a second time subsequent to the firsttime or a prediction of a missing piece of information when other partsare known. Input data representing a spatial pattern at the second timeis received. The performance of the spatial and temporal memory systemis evaluated by comparing the prediction of the input data representinga spatial pattern at the second time with the received input datarepresenting a spatial pattern at the second time.

Embodiments relate to a method and system for searching for temporalsequences of spatial patterns in data or for spatial patterns in eachrecord of data. A plurality of spatial and temporal memory systems aregenerated according to configuration information. A subset of input datais provided to each spatial and temporal memory system, and two or moreof the spatial and temporal memory systems are provided with differentfields of input data, and/or different encodings of the fields, and/ordifferent time aggregations of the data. Temporal sequences of spatialpatterns are identified at each spatial and temporal memory system basedon the provided subset of input data.

The features and advantages described in the specification are not allinclusive and, in particular, many additional features and advantageswill be apparent to one of ordinary skill in the art in view of thedrawings and specification. Moreover, it should be noted that thelanguage used in the specification has been principally selected forreadability and instructional purposes, and may not have been selectedto delineate or circumscribe the inventive subject matter.

BRIEF DESCRIPTION OF THE DRAWINGS

The teachings of the embodiments of the present invention can be readilyunderstood by considering the following detailed description inconjunction with the accompanying drawings.

FIG. 1A is a conceptual diagram of a single Spatial and Temporal MemorySystem (STMS) processing node in a non-hierarchical system, according toone embodiment.

FIG. 1B is a conceptual diagram illustrating a Hierarchical Spatial andTemporal Memory System (HTMS) including three layers of processingnodes, according to one embodiment.

FIG. 2 is a conceptual diagram illustrating an HTMS with multipleprocessing nodes at lower levels, according to one embodiment.

FIG. 3 is a block diagram illustrating an automated search system usingSTMSs, according to one embodiment.

FIG. 4 is a flowchart illustrating an overall automated search process,according to one embodiment.

FIG. 5 is a block diagram illustrating an automated search engine of theautomated search system, according to one embodiment.

FIG. 6A is a block diagram illustrating a STMS encoder, according to oneembodiment.

FIG. 6B is a flowchart illustrating the process of encoding dataretrieved from database based on configuration information, according toone embodiment.

FIG. 7 is a graph illustrating an example scheme for encoding entries ina database, according to one embodiment.

FIG. 8 is a graph illustrating another example scheme for encodingentries in a database, according to one embodiment.

FIG. 9 is a graph illustrating data values over an example time frame,according to one embodiment.

FIG. 10 is a graph illustrating aggregated data values of the time frameof FIG. 9, according to one embodiment.

FIG. 11 is a block diagram illustrating a processing node of a STMS,according to one embodiment.

FIG. 12 is a block diagram illustrating a sequence processor of a STMS,according to one embodiment.

FIG. 13 is a block diagram illustrating a decoder of an automated searchsystem, according to one embodiment.

FIG. 14 is a conceptual diagram illustrating a process of decoding anode output, according to one embodiment.

FIG. 15 is a flowchart illustrating a process of decoding a processingnode output, according to one embodiment.

FIG. 16 is a block diagram illustrating a performance evaluator in anautomated search engine, according to one embodiment.

FIG. 17 is a flowchart illustrating a process of evaluating theperformance of a STMS, according to one embodiment.

DETAILED DESCRIPTION OF EMBODIMENTS

In the following description of embodiments, numerous specific detailsare set forth in order to provide more thorough understanding. However,note that the present invention may be practiced without one or more ofthese specific details. In other instances, well-known features have notbeen described in detail to avoid unnecessarily complicating thedescription.

A preferred embodiment is now described with reference to the figureswhere like reference numbers indicate identical or functionally similarelements. Also in the figures, the left most digits of each referencenumber corresponds to the figure in which the reference number is firstused.

Reference in the specification to “one embodiment” or to “an embodiment”means that a particular feature, structure, or characteristic describedin connection with the embodiments is included in at least oneembodiment. The appearances of the phrase “in one embodiment” in variousplaces in the specification are not necessarily all referring to thesame embodiment.

Some portions of the detailed description that follows are presented interms of algorithms and symbolic representations of operations on databits within a computer memory. These algorithmic descriptions andrepresentations are the means used by those skilled in the dataprocessing arts to most effectively convey the substance of their workto others skilled in the art. An algorithm is here, and generally,conceived to be a self-consistent sequence of steps (instructions)leading to a desired result. The steps are those requiring physicalmanipulations of physical quantities. Usually, though not necessarily,these quantities take the form of electrical, magnetic or opticalsignals capable of being stored, transferred, combined, compared andotherwise manipulated. It is convenient at times, principally forreasons of common usage, to refer to these signals as bits, values,elements, symbols, characters, terms, numbers, or the like. Furthermore,it is also convenient at times, to refer to certain arrangements ofsteps requiring physical manipulations of physical quantities as modulesor code devices, without loss of generality.

However, all of these and similar terms are to be associated with theappropriate physical quantities and are merely convenient labels appliedto these quantities. Unless specifically stated otherwise as apparentfrom the following discussion, it is appreciated that throughout thedescription, discussions utilizing terms such as “processing” or“computing” or “calculating” or “determining” or “displaying” or“determining” or the like, refer to the action and processes of acomputer system, or similar electronic computing device, thatmanipulates and transforms data represented as physical (electronic)quantities within the computer system memories or registers or othersuch information storage, transmission or display devices.

Certain aspects of the embodiments include process steps andinstructions described herein in the form of an algorithm. It should benoted that the process steps and instructions of the embodiments couldbe embodied in software, firmware or hardware, and when embodied insoftware, could be downloaded to reside on and be operated fromdifferent platforms used by a variety of operating systems.

Embodiments also relate to an apparatus for performing the operationsherein. This apparatus may be specially constructed for the requiredpurposes, or it may comprise a general-purpose computer selectivelyactivated or reconfigured by a computer program stored in the computer.Such a computer program may be stored in a computer readable storagemedium, such as, but is not limited to, any type of disk includingfloppy disks, optical disks, CD-ROMs, magnetic-optical disks, read-onlymemories (ROMs), random access memories (RAMs), EPROMs, EEPROMs,magnetic or optical cards, application specific integrated circuits(ASICs), or any type of media suitable for storing electronicinstructions, and each coupled to a computer system bus. Furthermore,the computers referred to in the specification may include a singleprocessor or may be architectures employing multiple processor designsfor increased computing capability.

The algorithms and displays presented herein are not inherently relatedto any particular computer or other apparatus. Various general-purposesystems may also be used with programs in accordance with the teachingsherein, or it may prove convenient to construct more specializedapparatus to perform the required method steps. The required structurefor a variety of these systems will appear from the description below.In addition, embodiments are not described with reference to anyparticular programming language. It will be appreciated that a varietyof programming languages may be used to implement the teachings asdescribed herein, and any references below to specific languages areprovided for disclosure of enablement and best mode of the embodiments.

In addition, the language used in the specification has been principallyselected for readability and instructional purposes, and may not havebeen selected to delineate or circumscribe the inventive subject matter.Accordingly, the disclosure set forth herein is intended to beillustrative, but not limiting, of the scope, which is set forth in theclaims.

Embodiments relate to encoding various types of data into a distributedrepresentation format for processing by a STMS. Input data to the STMSmay be in a format incompatible for processing by STMS. Hence, anencoder receives the input data in a raw form and converts the inputdata into a distributed representation form. Different coding schemesmay be applied to different data sets and data types to increase theperformance of the STMS. In one embodiment, the coding schemes areiteratively modified to increase the performance of the STMS for a givendata set. Other aspects of the STMS may also be iteratively modified toimprove performance.

Embodiments also relate to assessing the performance of the STMS. A STMSmay exhibit different performance characteristics based on theconfiguration or parameters of the STMS or based on the coding schemeused, which includes factors such as the encoding used, the timeaggregations applied, and the input data that the STMS encodes andprocesses. The performance of the STMS may be assessed by determiningthe accuracy of the prediction of the STMS. Performance datarepresenting the predictive performance of the STMS are generated as aresult of the assessment. In one embodiment, the predictive performanceof the STMS is assessed by comparing predicted input data with actualinput data for one or more time steps. Based on the performance data, adesirable combination of coding schemes, node configurations and nodeparameters may be selected for processing further input data.

Embodiments also relate to identifying useful relationships betweendifferent data fields in a data set using a STMS. The STMS is capable ofidentifying temporal relationships in data in addition to identifyingspatial patterns in the data set. Using the capability of the STMS toidentify spatial patterns and temporal sequences, the STMS can moreaccurately determine relationships in data and make better predictionsof future data. Further, different combinations of coding schemes, STMSconfigurations and STMS parameters may be used to identify usefulpatterns or sequences in the data.

A STMS as described herein refers to hardware, software, firmware or acombination thereof that is capable of learning and detecting spatialpatterns and temporal sequences of spatial patterns in input data. TheSTMS stores temporal relationships in sequences of spatial patterns andgenerates useful information based on the stored relationships. Theuseful information may include, for example, predictions of spatialpatterns to be received, predictions of missing parts of spatialpatterns received, identifications of spatial patterns or a higher levelcauses associated with the spatial patterns in input data. The STMSincludes at least one processing node and an encoder. The processingnode may be embodied, for example, as described in U.S. patentapplication Ser. No. 13/046,464 entitled “Temporal Memory Using SparseDistributed Representation, filed on Mar. 11, 2011 (hereinafter referredto as “the '464 application”), which is incorporated by reference hereinin its entirety. In one embodiment, a spatial pooler in the STMSreceives input data in a distributed representation and processes theinput data for learning and/or predicting.

A distributed representation described herein refers to a format forrepresenting data. Data in a distributed representation form has alimited number of elements which may number in hundreds to thousands. Ina distributed representation form, different data are represented bydifferent combinations of active and inactive elements. Each element ina distributed representation can in theory be assigned an independentmeaning or attribute. Thus, a distributed representation is a set ofattributes that represent a data element. A special case of thedistributed representation form is the sparse distributed representationform, where the number of active (or inactive) elements is comparativelysmaller than the total number of elements.

An coding scheme as described herein refers to a methodology forconverting data in a first format to a second format. The first formatmay be incompatible for processing by a STMS, so conversion to a secondformat that is compatible for processing by the STMS is required priorto processing by the STMS. The coding scheme may define, among otherparameters, the following: (i) the selection of a subset of data fields,(ii) the selection of a subset of data within each data field, (iii) theaggregation of data over certain time intervals, (iv) the conversion ofthe format from one format to another format (e.g., to a distributedrepresentation format) and (v) the processing or supplementing of datafrom one source based on data from another data source.

An experiment as described herein refers to a process of configuring aSTMS and processing data using the configured STMS. For each experiment,the STMS is configured to use a particular coding scheme to encode inputdata with the STMS's encoder into a format for processing by the STMS'sprocessing node and operates with certain node parameters.

Performance data as described herein refers to data representing thequantification of the predictive performance of a STMS. Performance datamay indicate the percentage of accurate predictions made by the STMS orthe deviation of a predicted numeric value of input data compared to anactual numeric value in the input data.

An automated search as described herein refers to the performing of aplurality of experiments to identify predictive models that producepredictions of future data based on a set of given data. The experimentsmay be performed sequentially or in parallel.

Node parameters as described herein refer to configurable parametersthat affect the operation of a STMS. The configuration parameters mayinclude, for example, the number of processing nodes and theirconnective relationships, the number of cells or columns in the sequenceprocessors of the processing nodes, the rate of learning and forgettingto prune or expand co-occurrences and sequences, and the permissiblerange of density (or sparsity) of sparse vectors generated by spatialpoolers.

Architecture of a Spatial and Temporal Memory System

A STMS stores common spatial patterns in a stream of distributedrepresentations, learns temporal relationships in sequences of thespatial patterns, and generates useful information based on the storedrelationships. The useful information may include, for example,predictions of spatial patterns to be received, predictions of part of aspatial pattern that is missing, identifications of spatial patterns ortemporal sequences, or grouping patterns and sequences by similarity. ASTMS may include a plurality of processing nodes or a single processingnode, and may be of a non-hierarchical structure or of a hierarchicalstructure. A STMS with multiple processing nodes structured in ahierarchical manner is hereinafter referred to as Hierarchical Spatialand Temporal Memory System (HTMS).

FIG. 1A is a conceptual diagram of a non-hierarchical STMS including asingle processing node 104, according to one embodiment. The processingnode 104 receives input data, determines spatial patterns and temporalsequences in the input data and generates an output. The output of theprocessing node 104 is based on the spatial and temporal relationshipsbetween spatial patterns in the input data. The output may include aprediction of future spatial patterns and/or may indicate how well theprediction matched a subsequent spatial pattern in the input data.

FIG. 1B is a conceptual diagram illustrating an HTMS including threelayers of processing nodes, according to one embodiment. In an HTMS,multiple processing nodes learn, predict and infer input at differentlevels of abstraction. An example HTMS 100 of FIG. 1B comprises threelevels where each of level L1, L2 and L3 include one processing node110, 120 and 130, respectively. HTMS 100 has three levels L1, L2, L3,with level L1 being the lowest level, level L3 being the highest level,and level L2 being an intermediate level between levels L1 and L3. HTMS100 processes the input data, and outputs a signal that includes aprediction of future spatial patterns in the input and/or indicates howwell the prediction matched a subsequent spatial pattern in the input.

The processing nodes of the HTMS may be arranged so that the number ofprocessing nodes decreases as the HTMS level increases. FIG. 2 is adiagram illustrating HTMS 200 having three levels L1, L2, L3, with levelL1 being the lowest level, level L3 being the highest level, and levelL2 being an intermediate level between levels L1 and L3. HTMS 200 ishierarchically structured so that the processing nodes cover a largerinput space as the level ascends. Level L1 has nodes 210A, 210B, 210Cand 210D; level L2 has nodes 220A and 220B; and level L3 has node 230.Nodes 210A, 210B, 210C, 210D, 220A, 220B, and 230 are hierarchicallyconnected in a tree-like structure such that each processing node hasseveral children nodes (that is, nodes connected at a lower level) andone parent node (that is, node connected at a higher level).

Further, HTMS 200 propagates bottom-up signals up the hierarchy as wellas propagates top-down signals down the hierarchy. That is, eachprocessing node 210A, 210B, 210C, 210D, 220A, 220B, and 230 may bearranged to (i) propagate information up the HTMS hierarchy to aconnected parent node, and (ii) propagate information down the HTMShierarchy to any connected children nodes. In one embodiment,information propagated down the HTMS hierarchy includes performance datadescribing the success of a particular experiment. In anotherembodiment, information propagated down the HTMS hierarchy includespredictions of what sequences the child node is likely to receive next.

The number of levels or the arrangement of processing nodes in FIGS. 1A,1B and 2 are merely illustrative. Many variants of a STMS system may bedeveloped and deployed depending on the specific application.

A STMS includes one or more processing nodes and an associated encoder.Some of many functions performed by a processing node include, forexample, spatial pooling and temporal processing. The spatial poolingdescribed herein refers to the process of mapping distributed inputpatterns onto a set of coincidence detectors each of which learns commonspatial co-occurrences in the input patterns. The temporal processingmay include, but is not limited to, learning temporal sequences,performing inference, recognizing temporal sequences, predictingtemporal sequences, labeling temporal sequences and temporal pooling.The learning of temporal sequences described herein refers to one ormore of initializing, expanding, contracting, merging and splittingtemporal sequences. The prediction described herein refers to assessingthe likelihood that certain spatial patterns will appear subsequently inthe input data. The temporal pooling described herein refers toprocessing input data to provide an output that is more stable andinvariable over time compared to spatial patterns in the input data.Hardware, software, firmware or a combination thereof for performing thespatial pooling is hereinafter referred to as a spatial pooler.Hardware, software, firmware or a combination thereof for performing thetemporal processing is hereinafter referred to as a sequence processor.The sequence processor may perform one or more of learning temporalsequences, performing inference, recognizing temporal sequences,predicting temporal sequences, labeling temporal sequences and temporalpooling.

In one embodiment, one or more STMSs receive input data representingimages, videos, audio signals, sensor signals, data related to networktraffic, financial transaction data, communication signals (e.g.,emails, text messages and instant messages), documents, insurancerecords, biometric information, parameters for manufacturing process(e.g., semiconductor fabrication parameters), inventory patterns, energyor power usage patterns, data representing genes, results of scientificexperiments or parameters associated with operation of a machine (e.g.,vehicle operation) and medical treatment data. The STMS may process suchinputs and produce an output representing, among others, identificationof objects shown in an image, identification of recognized gestures,classification of digital images as pornographic or non-pornographic,identification of email messages as unsolicited bulk email (‘spam’) orlegitimate email (‘non-spam’), prediction of a trend in financialmarket, prediction of failures in a large-scale power system,identification of a speaker in an audio recording, classification ofloan applicants as good or bad credit risks, identification of networktraffic as malicious or benign, identity of a person appearing in theimage, processed natural language processing, weather forecast results,patterns of a person's behavior, control signals for machines (e.g.,automatic vehicle navigation), gene expression and protein interactions,analytic information on access to resources on a network, parameters foroptimizing a manufacturing process, predicted inventory, predictedenergy usage in a building or facility, web analytics (e.g., predictingwhich link or advertisement that users are likely to click),identification of anomalous patterns in insurance records, prediction onresults of experiments, indication of illness that a person is likely toexperience, selection of contents that may be of interest to a user,indication on prediction of a person's behavior (e.g., ticket purchase,no-show behavior), prediction on election, prediction/detection ofadverse events, a string of texts in the image, indication representingtopic in text, prediction of sales, prediction of needed resources suchas number of employees needed on any day or the amount of raw materialsneeded in a future time period, and a summary of text or prediction onreaction to medical treatments. The underlying representation (e.g.,photo, audio, sales data, and etc.) can be stored in a non-transitorystorage medium.

For the sake of simplicity, the following embodiments are describedprimarily with reference to a non-hierarchical STMS. However, similar orsame principle and operations as described herein are equally applicableto an HTMS.

Overall Structure and Operation of an Automated Search System

FIG. 3 is a block diagram illustrating an automated search system 300,according to one embodiment. The automated search system 300 mayinclude, among other components, a database or other source of datarecords 304, an automated search engine 310, encoders 320A through 320N(hereinafter collectively referred to as the “encoders 320”), processingnodes 340A through 340N (hereinafter collectively referred to as the“processing nodes 340”), and decoder 390. One or more of thesecomponents in automated search system 300 may be combined into a singlemodule or be divided into multiple modules. Further, each component maybe embodied in a single hardware device or may be distributed acrossmultiple hardware devices.

The automated search engine 310 includes hardware, software, firmware ora combination thereof that manages the overall process of an automatedsearch. The automated search engine 310 may perform, among others, thefollowing functions: (i) receiving and processing a user input 312, (ii)determining an order of experiments, (iii) selecting coding schemes forencoders 320, and (iv) configuring the processing nodes 340. Theautomated search engine 310 may iteratively perform multiple experimentson data from database 304 in parallel, in series or a combinationthereof until predetermined criteria are met. An example of theautomated search engine 310 is described below in detail with referenceto FIG. 5.

The decoder 390 includes hardware, software, firmware or a combinationthereof that decodes the node outputs 380A through 380N (hereinaftercollectively referred to as “node outputs 380”). The decoder 390 storesparameters of the processing nodes and processes the node outputs 380 toproduce the decoder output 395, which may be used to determine theaccuracy of predictions made by the processing nodes 340, as describedbelow in detail with reference to FIG. 13.

Each of the processing nodes 340 in combination with an encoder 320constitutes a distinct STMS for performing predictions. An example ofthe processing node 340 is described below in detail with reference toFIG. 11. Although only non-hierarchical STMSs, each with a single node,are illustrated in FIG. 3, hierarchically structured STMS with multipleprocessing nodes may also be used in the automated search system 300.

Encoder 320 includes hardware, firmware, software or a combinationthereof for encoding data 305 (retrieved from, for example, database304) into a format (e.g., distributed representation form) according toa coding scheme. Each encoder 320 is included in a STMS to encode datafor processing by an associated processing node 340. In one embodiment,each encoder 320 is instantiated and configured by the automated searchengine 310 to implement the experiments managed by the automated searchengine 310. An example embodiment of an encoder 320 is described belowin detail with reference to FIG. 6A. Although FIG. 3 displays only oneencoder 320 for each processing node 340, the automated search system300 may assign one encoder 320 to multiple processing nodes 340.

The database 304 provides data for analysis and/or processing by theautomated search system 300. Database 304 feeds data 305 to the encoders320 for conversion into a format compatible for processing with theprocessing nodes 340. Database 304 may be embodied on a computing deviceusing conventional technology or technology to be developed in thefuture. In addition to or alternatively to receiving data 305 fromdatabase 304, the automated search system 300 may receive data fromother sources such as point of sale (POS) devices, sensor devices, liveor real-time data streams, or external databases (hereinafter referredto as an “external data source”).

The Encoders 320 utilize one or more coding schemes to encode data 305into encoded input data 330 in a distributed representation formcompatible for processing by processing nodes 340. An encoder 320retrieves entries from one or more select data fields of the database304 according to a coding scheme. Each encoder 320 may retrieve datafrom distinct sets of data fields. For example, encoder 320A mayretrieve entries from a first data field, encoder 320B may retrieveentries from second and third data fields, encoder 320C may retrieveentries from fourth and sixth data fields, and so forth. In oneembodiment, the encoders 320 select the data fields retrieved by eachencoder 320. In an alternative embodiment, automated search engine 310selects the data fields each encoder 320 retrieves.

In one embodiment, the encoders 320 select a coding scheme to use inencoding data 305, or use a default coding scheme for encoding data 305.Alternatively, the encoders 320 may receive a coding scheme from theautomated search engine 310. For example, the automated search engine310 configures or instantiates one or more encoders 320 to encode data305 using one or more coding schemes. In one embodiment, the automatedsearch engine 310 selects a default coding scheme for use in configuringthe encoders 320, or selects a coding scheme according to a maintainedexperiment order. Alternatively, as discussed below in detail withreference to FIG. 4, the automated search engine 310 may select a codingscheme based on the performance of previously selected coding schemes.In addition, coding schemes may be selected based on analysis of thecontents of database 304 or based on analysis of selected data fields.For example, the automated search engine 310 analyzes the data stored intwo data fields in database 304 to select coding schemes for encodingthe data of the two data fields.

Each of the processing nodes 340 may include, among other components, aspatial pooler (one of spatial poolers 350A through 350N, hereinafter“spatial pooler 350”) which outputs a sparse vector 360 (one of sparsevectors 360A through 360N) to a sequence processor (one of sequenceprocessors 370A through 370N, hereinafter “sequence processor 370”). Aprocessing node 340 receives encoded input data 330 (one of encodedinput data 330A through 330N, hereinafter “encoded input data 330”) froman encoder 320, and the processing node's spatial pooler 350 performsspatial pooling on the encoded data 330 to produce a sparse vector 360.The sequence processor 370 of the processing node 340 receives thesparse vector 360, performs sequence processing and produces a nodeoutput 380. The node output 380 includes, among others, a prediction ofdata to be subsequently received at the processing node 340 oralternately a prediction of part of the data missing in the currentinput. The detailed operation of the processing nodes 340 is describedbelow in detail with reference to FIGS. 12 and 13.

Example Operation of an Automated Search System

Each STMS in the automated search system 300 analyzes, learns and makespredictions based on different perspectives of input data depending onthe configuration of the encoders 320 and the processing nodes 340. ASTMS may identify and learn different relationships in data 305 than adifferent STMS (e.g., a combination of processing node 340B and encoder340B) due to different coding schemes and configurations (e.g., variousnode parameters). By analyzing, leaning and making predictions ondifferent perspectives of input data, multiple STMSs may identifydifferent patterns and sequences in the input data, and produce usefulpredictions that would otherwise not be available by using a singleSTMS. The automated search system 300 automatically experiments withdifferent coding schemes and configurations to determine one or morepredictive models describing the input data.

FIG. 4 is a flowchart illustrating an overall automated search process,according to one embodiment. The automated search engine 310 issues arequest 306 and retrieves a subset of entries 306 in the database 304and/or the external data source 510 for preliminary analysis. Theautomated search engine 310 performs 410 preliminary analysis of thesubset of entries 410, which may take into account, for instance, thedata field type, the data category, the data content, and the datatrends or behavior. Based on the preliminary analysis, the automatedsearch engine 310 determines 420 coding schemes and node parameters ofthe STMSs. The automated search engine 320 can take other factors (e.g.,user input) in determining the coding schemes and the node parametersfor use by the STMSs.

In one embodiment, multiple sets of coding schemes and parameters aredetermined to instantiate or configure multiple sets of encoders andSTMSs for operation in parallel, as illustrated in FIG. 3. In anotherembodiment, a single coding scheme is determined to instantiate orconfigure a single STMS at a time. In this embodiment, multiple sets ofencoders and STMSs are instantiated or configured in series.

The determined coding scheme may indicate, among others, which datafields are to be included in each of encoded input data 330A through330N. For example, a first coding scheme may cause an encoder to includeconverted versions of first and second data fields in the encoded inputdata while a second coding scheme may cause another encoder to includeconverted versions of first and third data fields in the encoded inputdata. A STMS using the first coding scheme may identify spatial andtemporal relationships between data entries in first and second datafields whereas a STMS using the second coding scheme may identifyspatial and temporal relationships between data entries in first andthird data fields.

The automated search engine 310 instantiates or configures 430 encoders320 and corresponding processing nodes 340 according to the determinedcoding schemes and configuration parameters. The automated search system300 performs 440 experiments using encoders and processing nodesinstantiated or configured by the automated search engine 310. Eachexperiment includes the process of selectively converting one or moredata fields into encoded data input 330, and then feeding the encodeddata input 330 to the STMS's processing nodes. In response to receivingthe encoded data input 330, each STMS generates a node output 380. Morethan one set of encoders and processing nodes can be operatedsimultaneously to expedite the automatic search process.

Each of the node outputs 380A through 380M includes informationrepresenting predicted input data. Node outputs 380 are provided to thedecoder 390 to obtain decoder outputs 395. The decoder outputs 395 arefed to the automated search engine 310 to evaluate 450 the predictiveperformance of STMSs.

If it is determined 460 that the experiments satisfy predeterminedcriteria (e.g., reaching a limit of allocated computer time, or accuracyabove a particular threshold), a desired predictive model (in the formof the coding scheme used by the encoder and the associated processingnode configuration and parameters) is obtained and the process ends.Conversely, if the experiments do not satisfy the predeterminedcriteria, the coding schemes and parameters are updated 460 based on theevaluation. The process proceeds to instantiating or configuring 430STMSs and repeats the subsequent steps.

The processors and their sequences described in FIG. 4 are merelyillustrative. Additional steps may be added or omitted from theprocesses described in FIG. 4. For example, a predetermined number ofencoders and STMSs may be instantiated or configured 430 in parallel,and updating 460 may not be iteratively performed even when thepredetermined criteria are not met.

In one embodiment, the automated search engine 310 maintains a priorityor selection of experiments, each experiment associated with a differentcoding scheme and/or node parameters. The automated search engine 310modifies priority or selection of experiments based on the predictiveperformance of STMSs in experiments that were previously performed.Optimization algorithms or other heuristic algorithms may be used toachieve coding schemes, node parameters or a combination thereofexhibiting higher predictive performance in an efficient manner.

In one embodiment, processing by a STMS is terminated if the performanceof the STMS remains low or receives one or more error signals indicatingcertain types of errors are generated in the STMS. The automated searchengine may attempt to debug the errors or launch a new STMS to performanother experiment. In this way, less computing or storage resources arewasted on the STMS that is unlikely to be productive.

Example Architecture of an Automated Search Engine

FIG. 5 is a block diagram illustrating an automated search engine 310,according to one embodiment. The automated search engine 310 manages anoverall process of instantiating and configuring STMSs (i.e., sets ofencoders 320 and processing nodes 340), performs experiments using theSTMSs, evaluates the performance of the STMSs, and identifies one ormore STMSs yielding useful predictions. Automated search engine 310 mayinclude, among other components, database interface 500, performanceevaluator 520, data analysis module 530, configuration module 540, andSTMS interface 560.

The database interface 500 includes hardware, software, firmware or acombination thereof for retrieving data from a database 304 forpreliminary analysis and for use in evaluating predictions made bySTMSs. Database interface 500 may also request and receive data 508 froman external data source 510 to supplement or as an alternate to data inthe database 304. The external data source 510 may include point of sale(POS) devices, web resources, sensor signals and data provided by usersor data vendors. In one embodiment, the database interface 500 storesinformation on how to correlate certain data fields in the database 304with data available from the external data source 510. For example, thedatabase interface 500 stores information identifying that a data fieldon ‘date’ in the database 304 can be replaced with ‘weather information’corresponding to date field data available from an external data source.The database interface 500 provides sampled data 512 to the dataanalysis module 530 for preliminary analysis, and also provides rawinput data 505 to the performance evaluator 520 for evaluating thepredictive performance of a STMS. The raw input data 505 representsfields of data from the database 304 or the external data source 510that appears in a subsequent entry or time relative to data 305 causinga STMS to generate a decoder output 395 that is being compared with rawinput data 505.

The data analysis module 530 includes hardware, software, firmware or acombination thereof for performing preliminary analysis of sampled data512 received from the database 304 and the external data source 510 viathe database interface 500. The sampled data 512 includes a subset ofentries from the database 504 and subset of data available from theexternal database 510. Based on, for example, data field types, thenumerical range of values in the data, data trends or behavior, the dataanalysis module 530 generates and sends initial configurationinformation 516 to the configuration module 540.

The performance evaluator 520 includes hardware, software, firmware or acombination thereof for evaluating the decoder output 395 to produceperformance data 525 that indicates the capability or performance of aprocessing node 340 in making predictions, as described below in detailwith reference to FIG. 16.

The configuration module 540 includes hardware, software, firmware or acombination thereof for generating experiment parameters 514 based onone or more of user input 312, performance data 525, initialconfiguration information 516 and previously used experiment parameters.In one embodiment, the configuration module 540 uses an optimizationalgorithm to compute experiment parameters 514 for a next round ofexperiments or modifies experiment parameters 514 in a predeterminedorder of experiments. The configuration module 540 includes the codingscheme manager 550 for selecting coding schemes for a round ofexperiments. After the configuration module 540 determines one or moredata fields to be retrieved at a STMS, the coding scheme manager 550determines a data encoding for use by an encoder 320 and any parametersfor applying the data encoding, as described below in detail in thesection entitled “Coding Scheme Selection.” The coding schemes selectedby the coding scheme manager 550 are included in experiment parameters514.

Experiment parameters 514 define how the encoders 320 and the processingnodes 340 should be instantiated or configured in a current round ofexperiments. The experiment parameters 514 may define, for example,coding schemes and node parameters for each STMS. A coding schemedefines the manner in which an encoder converts the input data intoencoded input data for processing by an associated processing node. Thecoding scheme defines, (i) the selecting of a subset of data fields,(ii) the selecting of a subset of data within each data field, (iii) theaggregating of data over a time frame, (iv) the conversion of the formatfrom one format to another format (e.g., from a number, enumeratedvalue, or date to a distributed representation format) and (v) theprocessing or supplementing of data from one source based on data fromanother data source (e.g., an external data source). The node parametersdefine, for example, the number of processing nodes and their connectiverelationships, the number of cells or columns in the sequence processorsof the processing nodes, the activation of algorithms to prune or expandco-occurrences, and the permissible range of density (or sparsity) ofsparse vectors generated by spatial poolers.

In one embodiment, user input 312 includes information to facilitate theautomated search system 300 to learn and identify patterns and sequencesin the input data. If a user knows that a particular set of data fieldsare likely to be correlated or a certain time aggregation is likely toresult in meaningful predictions, the user may input user input 312 tothe configuration module 540 to start initial experiments using the userdefined parameters and configurations. The user input 312 may alsoidentify an external data source 510 for processing or for supplementingthe database 304.

The STMS interface 560 includes hardware, software, firmware or acombination thereof for distributing configuration information 315 toone or more STMSs for a round of experiments. The STMS interface 560receives the experiment parameters 514, formats the experimentparameters into configuration information (a combination of a codingscheme and node parameters) for each STMS, and transmits theconfiguration information to each STMS. In one embodiment, multipleSTMSs or STMS components are instantiated on computing devices dispersedin different locations. In such an embodiment, the STMS interface 560converts the configuration information 315 for transmission over anetwork to the desired computing devices.

Example Architecture and Operation of an Encoder

FIG. 6A is a block diagram illustrating an encoder 320 in a STMS,according to one embodiment. The encoder 320 retrieves data fromsources, processes the data (as needed) and converts the data into adistributed representation form for feeding into one or more processingnodes 340. The configuration of the encoder 320 may be reconfigured orupdated after a round of experiments is terminated. Alternatively, theconfiguration of the encoder 320 may be continuously updated duringexperiments.

Encoder 320 may include, among other components, a database interface600, an external data interface 610, a configuration module 620, a dataprocessing module 630, a time aggregation module 640, and a distributedrepresentation module 650. In some embodiments, the encoder 320 maycontain fewer or additional modules, and certain functionalities of theencoder 320 may be performed external to the encoder 320. For example,the functionality of the data processing module 630 or the timeaggregation module 640 is performed by the automated search engine 310.In some embodiments, the functionalities of the components of theencoder 620 may be combined into a single component. For example, thefunctionalities of the configuration module 620, the data processingmodule 630, the time aggregation module 640 and the distributedrepresentation module 650 are combined into a single processing module.

The configuration module 620 receives configuration information 315 fromthe automated search engine 310 and configures other components of theencoder 320 by sending out configuration signals 614, 618, 622, 626 and628 to implement a coding scheme as identified in the configurationinformation 315. Specifically, the configuration module 620 sends adatabase interface configuration signal 614 instructing the databaseinterface 600 to retrieve certain field(s) of data from the database304. For this purpose, the database interface 600 sends queries to thedatabase 304 and receives data 305 as a result. Depending on the data305 received from the database 304, the database interface 600 mayfurther extract relevant fields or entries 602 from the data 305 andsend them to the time aggregation module 640.

A similar process is applicable to the external data interface 610. Thatis, the configuration module 620 sends an external configuration signal644 to configure the external data interface 610 to receive externaldata 605 from the external data source 510. The external data interface610 may further extract relevant fields or entries 604 from the externaldata 605 and send them to time aggregation module 640.

The time aggregation module 640 performs time aggregations on thereceived data 602, 604, and sends the aggregated data 644 to the dataprocessing module 630. The time aggregation module 640 receives a timeconfiguration signal 618 from the configuration module 620 to performtime aggregation, as described below in detail with reference to FIGS. 9and 10. Although the time aggregation module 640 is indicated as beingplaced between the data source interfaces (i.e., the database interface600 and the external data interface 610) and the data processing module630, the time aggregation module 640 may be placed between the dataprocessing module 630 and the distributed representation module 650 toperform time aggregation on processed data. If no time aggregation isperformed, the extracted fields or entries 602 and 604 may bypass thetime aggregation module 640 and feed directly to the data processingmodule 630.

The data processing module 630 performs data processing operations onthe aggregated data 644 to generate processed data 630, according to apreprocessing signal 626 received from the configuration module 620. Thepreprocessing signal 626 defines how the data processing module 630should preprocess data before sending the data to the distributedrepresentation module 650. The data processing module 630 storesfunctions 632 to preprocess aggregated data 644 or extracted fields orentries 602 and 604 before conversion to a distributed representationformat. One or more functions 632 may be embodied as look-up tables orarithmetic processing units. Representative functions of the dataprocessing module 630 include scalar multiplications and variousfiltering functions. The data processing module 630 may be bypassed ifno further processing is to be performed on the aggregated data 644. Thedata processing module 630 may also replace or supplant data in certainextracted data fields or entries 602 from the database 304 with data inextracted fields or entries 604 from the external data source 510.

The distributed representation module 650 encodes processed data 634 (oraggregated data 644, or extracted fields or entries 602 and 604) to adistributed representation format. For each data field, the distributedrepresentation module 650 converts data entries into a distributedrepresentation format. The distributed representation module 650 thenconcatenates the converted data entries for different data fields,forming encoded input data 330. In one embodiment, the distributedrepresentation module 650 stores multiple mapping tables, with eachtable mapping possible values of each data field to certain distributedrepresentation formats. Details of coding schemes are described in thesubsequent section entitled “Coding Scheme Selection.”

Concatenating encoded fields together has the benefit of, among otherbenefits, allowing a processing node to detect spatial patterns andtemporal sequences across more than one data field. Table 1 illustratesan example where a first data field (Field 1) and a second data field(Field 2) each contains 4 data entries in a distributed representationformat. The Concatenated Input Data column of Table 1 shows theresulting concatenation of Field 1 and Field 2. Underlined portions ofthe Concatenated Input Data column entries in Table 1 represent dataassociated with the entries of Field 2. It should be noted that typicaldistributed patterns will contain many more bits than in Table 1.

TABLE 1 Data field concatenation example. Field 1 Field 2 ConcatenatedInput Data data[0] 0010110 100 0010110100 data[1] 0110010 111 0110010111data[2] 1001011 101 1001011101 data[3] 0100110 000 0100110000

FIG. 6B is a flowchart illustrating the process of encoding dataretrieved from the database 304 and/or the external data source 510,based on configuration information 315, according to one embodiment. Theencoder 320 receives 652 configuration information 315 from theautomated search engine 310. The encoder 320 then configures 656components (e.g., the data interface 600, the external data interface610, the time aggregation module 640, the data processing module 630 andthe distributed representation module 650) according to theconfiguration information 315. The configuration information 315 mayindicate the inactivation of one or more of the components in theencoder 320. For example, the time aggregation module 640 or the dataprocessing module 630 is deactivated. In case any of the components areinactive, data may bypass these inactive modules and feed directly tothe module subsequent to the inactive modules.

After the database interface 600 and the external data interface 610 areconfigured according to configuration information 315, the databaseinterface 600 interacts with the database 304 or the external datasource 510 to retrieve 670 data 305. The external data interface 610 mayalso interact with the external data source 510 to retrieve 670 externaldata 605 from the external data source 510, as determined byconfiguration information 315.

The database interface 600 or the external data interface 610 mayfurther extract 672 the selected fields 602 and 604 from data 305 andexternal data 605. If applicable, time aggregation is performed 674 onthe extracted fields 602 and 604. In addition, preprocessing isperformed 678 on the extracted fields 602 and 604 or the aggregated data644, if applicable.

After performing extraction, time aggregation and/or data preprocessing,the resulting data is encoded 682 into a distributed representationform. Encoding 682 may include concatenating multiple encoded datafields into a single binary vector.

The processes illustrated in FIG. 6B are merely illustrative. One ormore of (i) extracting 672 fields or entries, (ii) performing 674 timeaggregation and (iii) preprocessing 678 of data may be omitted. Further,steps may be performed in alternative orders or in parallel. Moreover,different fields of data may undergo different processing. For example,one field may be retrieved from the database 304 and then directlyencoded into a distributed representation form while another field mayundergo time aggregation or preprocessing before being encoded into adistributed representation form.

Coding Scheme Selection

Data for analysis may include data fields of various formats. Exampledata formats include integers, floating-point values, Boolean values andalphanumeric strings. However, a processing node in a STMS may becompatible with only a certain type of data format (e.g., a distributedrepresentation). Hence, in order to process data in a format that is notcompatible for processing by a processing node, the data is converted toa compatible data format using a coding scheme, as described herein.

Generally, coding schemes may be classified into the following threeseparate categories: (i) category coding schemes for converting data ofenumerated types (e.g., alphanumeric strings, integers with limitedvalues, or Boolean values) into a distributed representation, (ii)scalar coding schemes for converting scalar data (e.g., integers andfloating-point values) to a distributed representation, and (iii) hybridcoding schemes. The hybrid coding schemes use a combination of categorycoding schemes and scalar coding schemes to encode a data field. Dataused in hybrid coding schemes may be available from a single data source(e.g., a database 304) or available from multiple sources (e.g., adatabase 304 and an external data source 510).

An example of category coding scheme for encoding time entries into adistributed representation is described herein with reference toTable 1. In this example, suits of cards in a series of cards withdrawnfrom a card deck are converted to a distributed representation of 5bits:

TABLE 1 Encoding example by card type. bit[0] Club bit[1] Diamond bit[2]Heart bit[3] Spade bit[4] Other cardsUsing the coding scheme of Table 1, a card of a club suit is convertedto a distributed representation of “10000,” a card of a diamond suit isconverted to “01000,” a card of a heart suit is converted to “00100,” acard of a spade suit is converted to “00010,” and a card not belongingto any of these suits (e.g., joker card) is converted to “00001.”

Table 1 shows a simple encoding scheme using very few bits and whereeach encoded value is represented by a single bit and there is nooverlap between the different encodings. Generally a distributedencoding would use tens or hundreds of bits of which some smallpercentage are set to “1”. In such an encoding scheme the number ofdifferent values can be much greater than the number of bits used torepresent them. In such a scheme any two randomly chosen encodings wouldlikely share just a few bits in common. Further, it is possible toassign meanings to the individual bits such that encodings with similarmeanings would have an overlap that is greater than chance. In this waythe STMS can recognize patterns based on the meanings of the encodings.

An example of a scalar coding scheme is described herein with referenceto Table 2. In this example, the price of an item is converted to adistributed representation of 6 bits using a non-overlapping pricerange. For example, a data entry indicating a price of $25 is encoded to“000100” and data entry indicating a price of $45 is encoded into“010000.”

TABLE 2 Encoding example for prices. bit[0]  $0.00-$10.00 bit[1]$10.00-$20.00 bit[2] $20.00-$30.00 bit[3] $30.00-$40.00 bit[4]$40.00-$50.00 bit[5]  $50.00-$110.00

An alternative scalar coding scheme using overlapping ranges isdescribed herein with reference to Table 3. In this example, encodeddata in a distributed representation include bits representingoverlapping ranges. For example, a coding scheme produces a distributedrepresentation of 6 bits where each bit represents the following priceranges:

TABLE 3 Encoding example for prices. bit[0] $0.00-$30.00 bit[1]$10.00-$40.00  bit[2] $20.00-$60.00  bit[3] $40.00-$75.00  bit[4]$55.00-$100.00 bit[5] $70.00-$110.00Using this example encoding, the price $35 is encoded as the distributedrepresentation “000110”, and the price $59 is encoded as the distributedrepresentation “011100”. By overlapping numeric ranges corresponding toactive bits, encoded data entries with similar numerical values havemore bits in common than encoded data entries with dissimilar numeralvalues. Among other advantages, using data encoded with overlappingnumeric ranges facilitates the processing node 340 in learning andclassifying spatial co-occurrences in the input data. The same conceptof overlapping ranges can be applied to distribute representations usingtens or hundreds of bits.

FIG. 7 is a graph illustrating an example of a scalar coding schemeusing overlapping ranges (i.e., buckets), according to one embodiment.Bits of a distributed representation with overlapping ranges may bevisualized using overlapping buckets. The embodiment of FIG. 7 displaysan example distribution curve 710 of exam scores where buckets A throughI are distributed evenly along the exam score axis. This scalar codingscheme produces a distributed representation bit for each of the 9buckets, where the distributed representation bit is a “1” if aparticular exam score falls within a particular bucket. For example,exam score X is encoded as the distributed representation “011100000”,exam score Y is encoded as the distributed representation “000111000”,and exam score Z is encoded as the distributed representation“000011100”.

To provide better resolution for data in a particular range, buckets maybe distributed unevenly, concentrating the distribution of the bucketsaround particular values. FIG. 8 is a graph illustrating another examplescalar coding scheme for the same distribution curve 710 but withbuckets A′ through I′ placed differently compared to the example of FIG.7. Since the exam scores are distributed along a bell curve centered atthe exam score “75,” a scalar coding scheme clustering buckets around amedian exam score (e.g., around 75) provides better resolution of datacompared the scalar coding scheme of FIG. 7. In the coding scheme ofFIG. 8, exam score X is encoded as the distributed representation“011000000”, exam score Y is encoded as the distributed representation“001111100”, and exam score Z is encoded as the distributedrepresentation “000011110”. In one embodiment, a preliminary analysisperformed by the data analysis module 530 of the automated search engine310 includes identifying such a concentration of data values. Based onthe identification, scalar coding schemes for the encoders 320 may beconfigured for more efficient operations.

An example of a hybrid coding scheme is described herein with referenceto table 4. In this example, encoded data in a distributedrepresentation form includes bits indicating disparate information aboutthe same date where bits in encoded data represent the following:

TABLE 4 Encoding example for dates. bits[6-0] Day of the week: Mon =0000001, Tues = 0000010, etc. bit[18-7] Month of the year: Jan =000000000001, Feb = 000000000010, etc. bit[19] Holiday?: yes = 1, no = 0bit[20] First half of month?: yes = 1, no = 0 bits[23-21] Weather?: rain= 001, cloudy, no rain = 010, sunny = 100Using this example encoding, the date Dec. 28, 1981 is encoded as thedistributed representation (assuming it was raining)“001001000000000000000001”. The encoding scheme for Table 4 involvesboth category coding schemes and scalar coding schemes. That is, bits[6-0], [19], [20] and [23-21] are encoded using category encodingschemes whereas bit [18-7] are encoded using a scalar encoding scheme.

Another example of a hybrid coding scheme involves encoding data for adata field representing countries. Countries are an enumerated datatype. However, scalar data associated the countries may be encoded usinga category coding scheme or a scalar coding scheme. For example, thecoding scheme may generate encoded data to include bits related tolocation of a country (e.g., “001” if the country is located withinNorth America, and “010” if the country is located in Asia), bitsrepresenting the land size of the country, bits representing thepopulation of the country, bits representing the type of government ofthe country, and bits representing major industries of the countries. Inthis example, the name of countries, the continental location of thecountries and the major industries of the countries are encoded using acategory coding scheme while the other data are encoded using a scalarcoding scheme.

Some coding schemes may cascade multiple coding schemes or thepreprocessing of data. Such coding schemes include a logarithmic codingscheme which converts input data into log values, and then encodes thelog values to a distributed representation format using a scalar codingscheme.

A coding scheme also defines whether input data should be aggregatedover a particular time interval. Either the preliminary analysis of databy the automated search engine 310 or the user input 312 may indicatethat spatial patterns or temporal sequences are likely to beidentifiable if the data was aggregated over particular time intervals.In such cases, the automated search engine 310 may indicate a timeaggregation to be performed as part of a coding scheme, and an encodermay perform the time aggregation on data field entries as indicated bythe coding scheme. The aggregation may be performed using differentmethods (e.g., summing, averaging, or multiplying values in dataentries) depending on the nature of the data. The time interval foraggregation may be uniform or unequal depending on the application andthe nature of input data.

FIG. 9 is a graph illustrating the number of purchases made hourly overa day. For example, in hour 2, 8 purchases were made and in hour 17, 5purchases were made. FIG. 10 is a graph illustrating the number ofpurchases made in 4-hour time periods over a day for the same data setas FIG. 9, according to one embodiment. A STMS using data aggregatedover the 4-hour time periods may identify the general trend (e.g.,decreasing purchases over time) which could not be identified in datathat are not aggregated over time. By varying time aggregations, variousspatial patterns or temporal sequences may be identified by STMSs thatwould otherwise be unidentifiable or difficult to identify.

As described above with reference to FIG. 5, the automated search engine310 is responsible for selecting or creating a coding scheme for eachencoder 320. Specifically, the configuration module 540 of the automatedsearch engine 310 analyzes various factors such as the user input 312,the initial configuration information 516 and the performance data 525of previous experiments to determine coding schemes for a subsequentround of experiments. User input 312 may indicate a user preference of aparticular coding scheme or certain processing node parameters (e.g.,the use of a category coding scheme or a scalar coding scheme and timeaggregation parameters).

Initial configuration information 516 is generated as result of thepreliminary analysis by the data analysis module 530 taking into accountdata types in the data fields of the database 304, the general range ofvalues in certain data fields of the database 304, and the distributionor trend of fluctuation in the data values in the data fields of thedatabase 304. Initial configuration information 516 may also indicatethe preprocessing of data before the conversion to a distributedrepresentation form, such as: (i) the conversion of integer values tofloating point values, (ii) the identification of data corresponding tothe data entries of the database 304 using a look-up table, (iii) themultiplication by a scalar value, and (iv) the application of a functionor transform to the data (e.g., a linear, logarithmic, or dampeningfunction, or a Fourier transform) to change the range of data values.Alternatively, the configuration module 540 may store and use defaultcoding schemes for an initial round of experiments without performingpreliminary analysis.

Performance data 525 indicative of predictive performance of a STMS in around of experiments may be taken into account to configure STMSs forfurther rounds of experiments. Various types of optimization algorithmsmay be used to improve configurations of STMSs over multiple rounds ofexperiments or to prematurely end experiments that do not lookpromising.

Example Functions and Operations of a Processing Node

FIG. 11 is a block diagram illustrating a processing node 340 of a STMS,according to one embodiment. The functions and operations of theprocessing node 340 are described in further detail in the '464application, and are briefly described herein for the sake of brevity.As shown in FIGS. 1 and 2, processing nodes 340 may operate asstand-alone nodes or may operate as part of a hierarchy of processingnodes to detect spatial patterns and temporal sequences, and to performpredictions or inference based on the learned patterns and temporalsequences.

The processing node 340 may include, among other components, a spatialpooler 350 and a sequence processor 370. The spatial pooler 350 receivesencoded input data 330, performs spatial pooling, and outputs a sparsevector 360 to the sequence processor 370. The sparse vector 360 includesinformation about co-occurrences (stored spatial patterns that werelearned from the data) detected in the encoded input data 330. Thesequence processor 370 receives the sparse vector 360 from the spatialpooler 350, performs temporal processing, and outputs a node output 380.The node output 380 includes information on the detected temporalsequences of spatial patterns and the prediction of temporal sequencesin the encoded input data 330.

Spatial pooling is the process of forming a sparse distributedrepresentation from a distributed input pattern. The output bits of thespatial pooler are learned common co-occurences of input bits. Referringto FIG. 11, the spatial pooler 350 may include, among other components,a sparsity generator 1360 and a plurality of co-occurrence detectors(CDs) 1140A through 1140Z (hereinafter referred to as “CDs 1140”). Inone embodiment, each CD 1140 is mapped to a subset of elements in theencoded input data 330. As illustrated in FIG. 11 by lines extendingfrom the CD 1140A to a subset 1120 of arrows representing input databits, the CD 1140A is mapped to receive a subset 1120 of elements frombits [0:8] of the encoded input data 330. Similarly, the CD 1140B ismapped to receive a subset 1130 of elements from bits [9:17] of theencoded input data 330. In order for the CDs 1140 and the spatial pooler350 to operate, the encoded input data 330 is in a distributedrepresentation form to indicate which of the elements in the encodedinput data 330 are active and which are inactive. In FIG. 11 the inputbits to each CD are shown as separate and non-overlapping subsets of theencoded input data 330. This is for clarity only. Generally, the inputbits to each CD are overlapping and intermixed.

The CDs 1140 detect similarity between the spatial patterns of thereceived subset of elements of the encoded input data 330 and the storedspatial patterns (i.e., co-occurrences), and generate match scores 1350indicating the degree of detected similarity. In one embodiment, ahigher match score indicates greater overlap between the subset ofelements of the encoded input data 330 and the associated co-occurrencesof each CD 1140. The match scores 1150 are provided to the sparsitygenerator 1360. In response, the sparsity generator 1160 generates thesparse vector 360 in a sparse distributed representation form.

The sparsity generator 1160 collects the match scores 1350 from the CDs1140, and selects a number of CDs 1140 based on their match scores andthe match scores of nearby CDs 1140 that satisfy conditions to generatethe sparse vector 360. In one embodiment, when a CD becomes dominant(i.e., the CD has a high match score), the CD inhibits the selection ofother CDs within a predetermined range (hereinafter referred to as “aninhibition range”). The inhibition range may extend only to CDsimmediately adjacent to the dominant CD or may extend to CDs that areseparated from the dominant CD by a predetermined distance.Alternatively, the sparsity generator 1160 may select a subset of CDswith the highest match scores among all CDs in the processing node.

In one embodiment, the sparse vector 360 may contain one vector elementfor each CD 1140. In this embodiment, if a CD is selected by thesparsity generator 1160, the vector element associated with the CDbecomes active. For example, if the spatial pooler 350 contains ten CDs1140, and the sparsity generator 1160 selects the first CD and thefourth CD based on the associated match scores 1150, the sparse vector360 is (1, 0, 0, 1, 0, 0, 0, 0, 0, 0), where the first and fourthelements are one but other elements are zero. The density (or sparsity)of the sparse vector 360 representing the ratio of selected CDs amongall CDs 1340 is governed by the inhibition range and the match scoreselection threshold value. In another embodiment the CDs output a scalarvalue and each element in the output 360 of the sparsity generator 1160is a scalar.

As the inhibitory range of a dominant CD increases, the density of thesparse vector 360 decreases. Further, as the selection threshold valueincreases, the density of the sparse vector 360 increases. Conversely,as the inhibitory range of a dominant CD decreases, the density of thesparse vector 360 increases. Also, as the selection threshold valuedecreases, the density of the sparse vector 360 decreases. Thecombination of the inhibitory range and the selection threshold valuemaintains the density (or sparsity) of the sparse vector 360 within acertain range. Alternatively, a fixed number of CDs may be selected fromall CDs 1340 based on the match scores 1350.

FIG. 12 is a block diagram illustrating a sequence processor 370 of aprocessing node, according to one embodiment. The sequence processor 370may include, among other components, a column activator 1200, columnmanagers 1215A through 1215Z (hereinafter collectively referred to as“column managers 1215”) coupled to columns 1210A through 1210Z(hereinafter collectively referred to as “columns 1210”), and an outputcompiler 1260. The sequence processor 370 receives the sparse vector 360from the spatial pooler 350, performs temporal processing, and outputs anode output 380. Temporal processing includes various time-basedprocessing of sequential spatial patterns such as the recognizing,predicting or labeling of temporal sequences. The sequence processor 370learns and stores the transitions between the spatial patterns asrepresented by the sparse vector 360. Based on the learned transitions,the sequence processor 370 recognizes and predicts subsequent sparsevectors 360.

The sequence processor 370 performs temporal processing by selectivelyactivating cells (and columns 1210), and learning the previous states ofcell activations. The cells learn to anticipate spatial patterns in theencoded input data 330 and activate before the corresponding spatialpatterns actually appear in the encoded input data 330. When a cellbecomes active, the cell sends out inter-cell inputs 1240 to other cellsto indicate the activation state of the cell. A basic idea behindimplementing temporal processing is to have a learning cell, uponactivation, detect and store the identities of other active cells. Thestored active cells may be currently active and/or may have beenpreviously active. When a cell detects the activation of a thresholdnumber of stored cells via inter-cell inputs 1240, the cell becomesactive and the column 1210 containing the cell outputs an active columnoutput 1250.

Based on the connections to other cells, a cell may be activated inadvance before receiving column activation signals 1205 indicating acorresponding column to be activated, or a “prediction”. In oneembodiment, with exposure to repeated temporal sequences, the cells makeconnections to earlier activation states of other cells; hence, thecells become activate earlier in time and make longer term predictions.For each cell, the sequence processor 370 may tally a cell confidencescore indicating how likely the advanced activation of the cell will befollowed by a column activation signal. In one embodiment the confidencescore is calculated by determining the percentage of times a predictedcell was followed by a column activation. A high confidence scoreindicates that early activation of the cell is very likely to bepredictive of a corresponding spatial pattern whereas a low confidencescore indicates that early activation of the cell was not as oftenfollowed by a corresponding spatial pattern.

In some embodiments, a column of the sequence processor 370 is activatedwhen any cell in the column is activated. In such embodiments, a columnconfidence score may be adopted to indicate the predictive performanceat the column level. The column confidence score indicates how likelythe advanced activation of the column (based on early or predictiveactivation of any cells in the column) will be subsequently followed bya column activation signal indicating the activation of the cell.

The column activator 1200 receives the sparse vector 360 from thespatial pooler 350. In response, the column activator 1200 generatescolumn activation signals 1205 indicating which columns to activatebased on the sparse vector 360. Each column 1210 is connected to anassociated column manager 1215 and contains a number of cells. Eachcolumn manager 1215 receives the column activation signal 1205,determines activation states of cells in the column (based on theactivation signal 1205), and sends a select signal 1220 to activate oneor more cells in the column 1210. The activated cells then learn atemporal sequence by making connections to active cells in other columns1210 through inter-cell inputs 1240. Although not shown in FIG. 12,inter-cell inputs 1240 may exist between each pair of columns and evenbetween cells in the same column. The column activator 1200 receives thesparse vector 360, determines which elements of the sparse vector 360are active, and sends column activation signals 1205 to correspondingcolumns 1210 to activate these columns 1210. In one embodiment, theoutput compiler 1260 collects the outputs from the columns 1210 andconcatenates these outputs as the node output 380.

Decoding of Node Output

The decoding of the node output 380 herein refers to converting the nodeoutput 380 into values or parameters predicted to be received at acorresponding STMS. The predicted values or parameters may be entryvalues for data fields in the database 304, values of the external data605, or intermediate values or parameters generated at different stagesof processing at a STMS. The decoding may be performed for variousreasons, including for determining the accuracy of prediction at a STMS,as described in the section entitled “Performance Evaluation of aSpatial and Temporal Memory System,” and for generating a prediction tobe used by a person or program.

Decoding can be performed at different levels of STMS processing. Thecomplete decoding of the node outputs 380 may be advantageous, for amongother reasons, because errors or irregularities at the encoders 320 orthe spatial poolers 350 will have less effect on the decoded data.Corruption of data and any inadequate processing by the encoders 320 orthe spatial poolers 350 may be removed or reduced when the reverseprocessing of the encoders 320 and the spatial poolers 350 is performed.Complete decoding is also useful to output a prediction in the form ofthe original data. Partially decoding the node outputs 380 to the sparsevector 360 format (hereinafter referred to as a “sequence probabilityvector”) or to the encoded input data 330 format (hereinafter referredto as a “predicted spatial pooler input”) may also be performed.Partially decoding the node outputs 380 consumes less computingresources and can also be used to identify issues with the encoders 320and the spatial poolers 350.

FIG. 13 is a block diagram illustrating the decoder 390, according toone embodiment. The decoder 390 may include, among other components, aSTMS interface 1300, a reverse sequence processor 1310, a reversespatial pooler 1320, and a reverse encoder 1330. The STMS interface 1300receives and caches the node output 380. The node output 380 includespredictions on input data to be subsequently received at the STMS. TheSTMS interface 1300 then forwards the node output 380 to the reversesequence processor 1310 for processing. For simplicity, the decoder 390will be described in terms of receiving a single node output 380 from asingle processing module 340, but it should be noted that a decoder 390may receive and decode node outputs 380 from any number of processingmodules 340. In addition, although only one decoder 390 is illustratedin FIG. 3, any number of decoders 390 may be implemented in theautomated search system 300. More than one decoder may be provided inthe automated search system 300 to decode node outputs 380 fromdifferent STMSs.

In one embodiment, the STMS interface 1300 receives STMS information1342 from the STMS whose node output 380 is being decoded. The STMSinformation 1342 includes information associated with the learnedpatterns and sequences at the STMS and the coding schemes for theencoder of the STMS. The STMS interface 1300 analyzes the STMSinformation and sends out the sequence processor information 1315, thespatial pooler information 1325, and the encoder information 1335 to thereverse sequence processor 1310, the reverse spatial pooler 1320 and thereverse encoder 1330, respectively. The sequence processor information1315 may include, among other information, the sequence processorconfiguration parameters (e.g., the number of sequence processor cellsand columns), the data stored in the temporal memory segments, and anyother information related to the operation of the sequence processor370. The spatial pooler information 1325 may include, among otherinformation, the spatial pooler configuration parameters (e.g., thenumber of co-occurrence detectors), the mappings between CDs 1340 andthe subsets of elements in the encoded input data 330, and any otherinformation related to the operation of the spatial pooler 350. Theencoder information 1335 may include, among other information,information related to the coding schemes and any other informationrelated to the operation of the encoder 320. The sequence processor1310, the reverse spatial pooler 1320 and the reverse encoder 1330 areconfigured accordingly to decode the node output 380.

FIG. 14 is a conceptual diagram illustrating a process of decoding thenode output 380, according to one embodiment. In the example of FIG. 14,the decoder 390 decodes the node output 380 generated by a sequenceprocessor of a processing node having 8 columns, each column including 4cells. The reverse temporal pooler 1310 copies the same column and cellstructure of the counterpart processing node. Hence, the reversetemporal pooler 1310 also has 8 columns, each column including 4 cells.

As described above with reference to FIG. 11, a cell confidence scoreindicates how likely the advanced activation of the cell will indeed befollowed by a column activation signal in the sequence processor 370,indicating the activation of the column. For decoding, the confidencescores 1400 of cells are copied from the sequence processor 370 of acorresponding processing node and stored in the reverse temporal pooler1310. In this example, a confidence scores takes a value not over 1 andnot less than 0, and represents the percentage of time that theprediction of the cell output was accurate. For example, a confidencescore of 0.7 indicates that the advanced activation of the correspondingcell in a column was followed by encoded input data activating thecolumn 70% of the time.

In one embodiment, the reverse temporal pooler 1310 determines thehighest cell confidence scores in the active columns and determines thesequence probability vector 1410. The sequence probability vector 1410is similar to the sparse vector 360 fed to the sequence processor 370 ina processing node with the exception that the active elements in thesequence probability vector 1410 are represented in probability valuesrather than integer values of 1 or 0 to account for the fact that thesequence probability vector 1410 is a predicted sparse vector derivedfrom the node output 380 rather than an actual sparse vector 360generated from the encoded input data 330. Sequence probability vector1410 is assembled by assigning the column confidence scores of activecolumns (having a “1” value in the corresponding elements of the nodeoutput 380) to the corresponding elements in the sequence probabilityvector 1410 while assigning a value of zero to the elements of thesequence probability vector 1410 corresponding to the inactive elementsin the node output 380.

In the example of FIG. 14, the elements of the node output 380associated with the columns 0, 2, 6 and 7 are active and the otheractive node elements are inactive. For the active columns, the highestcell confidence score for all cells in the column is taken as the columnconfidence score. For example, for column 0, cell 4 has the highest cellconfidence score of 0.7, and hence, the column confidence score forcolumn 0 is set to 0.7. For column 2, cell 2 has the highest confidencescore of 0.3, and hence, the column confidence score for column 2 is setto 0.3. After determining the column confidence scores, the reversetemporal pooler 1310 generates the sequence probability vector 1410 byassigning the column confidence scores to elements corresponding to theactive columns while assigning zeros to the inactive columns. In theexample of FIG. 14, the sequence probability vector 1410 is (0.7, 0,0.3, 0, 0, 0, 0.5, 0.8).

In an alternative embodiment, all cell confidence scores 1400 of acolumn are added or averaged to obtain a column confidence score of thesame column instead of taking the highest cell confidence score of cellsin the column.

The reverse spatial pooler 1320 receives the sequence probability vector1410 and determines the predicted spatial pooler input 1440 based on themappings 1420 between the elements of the sequence probability vector1410 and the elements of the predicted spatial pooler input 1440. Thepredicted spatial pooler input 1440 is similar to the encoded input data330 fed to the spatial pooler 350 except that the elements in thepredicted spatial pooler input 1440 are represented in probabilityvalues rather than an integer value of 0 or 1 to account for the factthat the predicted spatial pooler input 1440 is a prediction of theencoded input data to the spatial pooler 350 rather than the actualencoded input data. The mapping between the elements of the sequenceprobability vector 1410 and the elements of the predicted spatial poolerinput 1440 are the same as mappings between the CDs in the spatialpooler 350 and the encoded input data 330 (refer to FIG. 11).

One way of generating the predicted spatial pooler input 1440 is toassign an average value of the sequence probability vector elementsmapped to a spatial pooler input element as the value for the samespatial pooler input element. Taking the example of the mapping 1420 inFIG. 14, bit [0] of the predicted spatial pooler input 1440 is notmapped to any non-zero elements of the sequence processor probabilityvector 1410. Hence, bit [0] of the predicted spatial pooler input 1440takes a value of zero. Bit[1] of the predicted spatial pooler input 1440is mapped only to the first element of the sequence processorprobability vector 1410 (having a value of 0.7), and hence, the value of0.7 is assigned to bit [1] of the predicted spatial pooler input 1440.Similarly, bit[4] of the predicted spatial pooler input 1440 is mappedonly to the third element of the sequence probability vector 1410(having a value of 0.3), and hence, the value of 0.3 is assigned to bit[4] of the predicted spatial pooler input 1440. On the other hand,bit[7] of the predicted spatial pooler input 1440 is mapped to both thefirst element (having value of 0.7) and the 99^(th) element (havingvalue of 0.5) of the sequence probability vector 1410, and hence, thevalue of 0.6 (the average of 0.7 and 0.5) is assigned to bit [7] of thepredicted spatial pooler input 1440. The reverse spatial pooler 1320populates all the bits of the predicted spatial pooler input 1440 byaveraging values of the elements in the sequence probability vector 1410mapped to each bit of the predicted spatial pooler input 1440.

The reverse spatial pooler 1320 may apply functions other than thedetermining the average to elements of the sequence processor probablevector 1410 to produce elements of the predicted spatial pooler input1440. In one embodiment, the reverse spatial pooler 1320 determinesvalues for each element in the predicted spatial pooler input 1440 bytaking the maximum value of the sequence processor probability vectorelements mapped to the element of the predicted spatial pooler input1440. Alternatively, the reverse spatial pooler 1320 may determinevalues for each element in the predicted spatial pooler input 1440 bytaking the sum, the average or the median value of the sequenceprocessor probability vector elements mapped to the element of thepredicted spatial pooler input 1440. The reverse encoder 1330 receivesthe predicted spatial pooler input 1440 and produces the decoder output395. The decoder output 395 will be a predicted version of the data 634.In one embodiment, the reverse encoder 1330 may include, among othercomponents, a segment module 1466, one or more decoder tables 1450A and1450B (hereinafter collectively referred to as “decoder tables 1450”),one or more dot product modules 1460A and 1450B (hereinaftercollectively referred to as “dot product modules 1460”), and an inputtranslator 1470. The segment module 1466, the decoder table 1450, thedot product module 1460 and the translator 1470 may be configured orinstantiated based on the encoder information 1335 received at thereverse encoder 1330. The number of decoder tables 1450 and dot productmodules 1460 may differ depending on the number of encoded data fieldsconcatenated in a corresponding encoder.

When a corresponding encoder concatenates encoded vectors of multiplefields, the segment module 1466 segments the predicted spatial poolerinput 1440 into multiple segments, each corresponding to a data field ofthe data 305 (or the external data 605). As described above withreference to FIG. 6, the distributed representation module 650concatenates encoded data for each data field into the encoded inputdata 330. The segment module 1466 reverses this process and segments thepredicted spatial pooler input 1440 into multiple segments. Taking theexample of FIG. 14, a counterpart encoder of the decoder 390 receivestwo data fields of 50 bits each and concatenates the encoded datafields. The segment module 1466 splits the predicted spatial poolerinput 1440 into the segments 1468A and 1468B and provides the segments1468A and 1468B to the corresponding dot product modules 1460A and1460B. If a corresponding encoder generates the encoded input data 330for a single data field without concatenation with vectors of anotherfield, then segmentation of the predicated spatial pooler input 1440does not occur.

Each decoder table 1450 is used for decoding a segment of the predictedspatial pooler input 1440 corresponding to a data field. As set forthabove in the section entitled “Coding Scheme Selection,” each data fieldof the data 305 and/or the external data 605 is encoded in a differentmanner. The decoder table 1450 for each segment has a number of columnscorresponding to the number of elements in the segment and a number ofrows corresponding to each possible unique output data 330 that can begenerated for a corresponding data field by a corresponding encoder 320

In one embodiment, each element in the decoder table 1450 has a binaryvalue of 0 or 1. Referring to FIG. 6, the decoder table 1450 is obtainedby copying mapping information (e.g., a mapping table) in the encoder320, indicating the mapping between values of entries in a data fieldwith a vector in a distributed representation format in the distributedrepresentation module 650 (refer to FIG. 6). Each row of the decodertable 1450 represents an output vector of encoded input data produced atthe distributed representation module 650 in response to receiving adata field value in the processed data 634 (or the aggregated data 644,or the extracted fields 602 and 604, depending on whether preprocessingor time aggregation is performed). In the example of FIG. 14, thedecoder table 1450A has n rows and 50 columns. Hence, the distributedrepresentation module 650 corresponding to the reverse encoder 1330produces n discrete segments of the encoded input data 330, with eachsegment having 50 elements.

Each dot product module 1460 receives a segment of the predicted spatialpooler input 1440 and performs a dot product operation between a segmentof the predicted spatial pooler input 1440 and each row of the decodertable 1450. Specifically, the dot product module 1460A computes dotproduct values for each row of the decoder table 1450A by performing dotproduct operations between the segment 1464A and the row of the decodertable 1460B. The dot product module 1460A then determines an index ofthe row 1464A that results in the highest dot product value. Similarly,the dot product module 1460B computes dot products values for the rowsof the decoder table 1450B and the segment 1464B, producing an index ofthe row 1464B that results in the highest dot product value. The dotproduct modules 1460A, 1460B then send the selected table row indices1464A and 1464B to the translator 1470.

The translator 1470 receives the row indices 1464A and 1464B, identifiesthe values corresponding to the indices 1464A and 1464B, and produces adecoder output 395. In one embodiment, the translator module 1470outputs a decoder table row index as the decoder output 395. In oneembodiment, the translator 1470 retrieves the data values correspondingto the received row indices. Such data values represent the predictedvalues of the data fields fed to the encoder of a corresponding STMS.For example, the encoder 320 receives a scalar value (e.g., 85.27), andencodes the scalar value to an encoded data input segment (e.g., (1, 0,0, 1, 1, 0, 1)). In this example, a decoder table of a correspondingdecoder contains a row with a vector corresponding to the encoded datainput segment (e.g., (1, 0, 0, 1, 1, 0, 1)). If the value predicted bythe STMS is the same or a similar scalar value (e.g., 85.27), the dotproduct value for a row (e.g., the 5^(th) row) corresponding to thesimilar scalar value (e.g., 85.27) results in the highest dot productvalue. The input translator 1470 then identifies the scalar value (e.g.,85.27) by determining a value corresponding to the row (e.g., the 5^(th)row). The translator 1470 may output any format of the data value aspart of the decoder output 395.

In one embodiment, the translator 1470 determines and outputs a range ofvalues for a decoding table row index. For example, if an encoder tablehas n rows, each representing a range of x, the translator 1470generates (i) data values between 0 and x in response to receiving afirst row index, (ii) data values between x and 2x in response toreceiving a second row index, and so forth. Alternatively, thetranslator 1470 may output midpoint values of the range, valuesdetermined by a predetermined function, or a random value within therange.

FIG. 15 is a flowchart illustrating a process of decoding a processingnode output 380, according to one embodiment. The STMS interface 1300receives STMS information 1342 from a STMS and configures 1500 thedecoder 390 to decode the node output 380. Specifically, the STMSinterface 1300 generates and outputs the sequence processor information1315, the spatial pooler information 1325, and the encoder information1335 to the reverse sequence processor 1310, the reverse spatial pooler1320 and the reverse encoder 1330, respectively, and configures thesecomponents for decoding the node output 380.

The decoder 390 receives 1510 the node output 380 generated by the STMSat the STMS interface 1300. The reverse temporal pooler 1310 determines1520 the sequence probability vector 1410 by analyzing the cellconfidence scores of the columns indicated as being active by the nodeoutput 380.

The reverse spatial pooler 1320 then processes 1530 the sequenceprobability vector 1410 and outputs the predicted spatial pooler input1440. The reverse encoder 1330 determines 1540 the predicted values ofthe data fields based on the predicted spatial pooler input 1440.Specifically, the segment module 1446 divides up the predicted spatialpooler input 1440 into multiple segments 1468A and 1468B correspondingto each data field. The dot product operations are performed on themultiple segments 1468A and 1468B at the dot product modules 1460A and1460B using the decoder tables 1450A and 1450B to determine the indicesof rows having the highest dot product values. The indices 1464A and1464B are sent to the translator 1470 where corresponding values of thepredicted data fields are determined based on the indices 1464A and1464B.

The process of FIG. 15 is merely illustrative. Some of the steps, suchas the configuring 1500 and the receiving 1510 steps, can be performedin parallel. Further, additional steps may be performed to verify theaccuracy of the decoding at various levels or to enhance the performanceof the decoder 390.

Although the embodiments described above with reference to FIGS. 13through 15 fully decode the node output 380 to the format of the datafields received at a corresponding STMS, partial decoding may beperformed to produce the sequence probability vector 1410, the predictedspatial pooler input 1440 or any other information derived therefrom asthe decoder output 395.

Performance Evaluation of a Spatial and Temporal Memory System

The predictive performance of a STMS may be evaluated in various ways.One way of evaluating the predictive performance is to decode the nodeoutput 380 of a STMS, and compare the decoded node output with inputdata subsequently received at the STMS. The decoded node output may bein the form of the decoder output 395, described above in detail withreference to FIGS. 13 and 14.

FIG. 16 is a block diagram illustrating the performance evaluator 520 inan automated search engine 300, according to one embodiment. One of themany functions of the performance evaluator 520 is to compare thedecoder output 395 and the raw input data 505 to determine theperformance data 525. As discussed above with reference to FIG. 5, theconfiguration module 540 receives the performance data 525 and selects acoding scheme based on the performance data 525.

The performance evaluator 520 may be one of many components in theautomated search engine 310 as illustrated in FIG. 5, or the performanceevaluator 520 may operate as a stand-alone module. The performanceevaluator 520 may include, among other components, a prediction accuracymodule 1600, an averaging module 1610, and a prediction score module1630. The prediction accuracy module 1600 receives and performs acomparison between the decoder output 395 and the raw input data 505,and outputs the result of the comparison 1604 to the averaging module1610. The raw input data 505 represents the fields of data from thedatabase 304 or the external data source 510 that appear in a subsequententry or time relative to the data 305. That is, the decoder output 395represents a prediction of future raw input data 505. By comparing thedecoder output 395 and the raw input data 505, the predictiveperformance of the STMS can be determined.

The averaging module 1610 tracks the comparison result 1604, computesthe average score 1614 of the prediction based on the comparison result1604, and sends the computed average score 1614 to the prediction scoremodule 1630. The prediction score module 1630 further processes orformats the averaged score 1614 to generate the performance data 525.The processing performed at the prediction score module 1630 cannormalize the average scores for different types of data being comparedat the prediction accuracy module 1600 so that the performance of STMSscan be assessed in a consistent manner across data of different typesand varying ranges.

In one mode of operation, the prediction accuracy module 1600 outputs a“0” if the decoder output 395 and the raw input data 505 are notidentical, regardless of the degree of similarity between the decoderoutput 395 and the raw input data 505. Such a comparison scheme isapplicable, for example, in cases where a category encoding scheme isused by the encoder 320. When a category encoder is used, the degree ofdifference in the data may not have a useful meaning. Hence, whether thedecoder output 395 and the raw input data 505 are identical may be thesole factor in evaluating the predictive performance of a STMS using acategory encoding scheme.

In another mode of operation, the prediction accuracy module 1600outputs a result 1604 representing the similarity between the decoderoutput 395 and the raw input data 505. The differences may berepresented in terms of percentages, in absolute terms, in logarithmicterms or in other suitable manners. When a scalar coding scheme is usedfor a data field, the similarity or difference between the decoderoutput 395 and the raw input data 505 has a useful meaning. That is, thedifference between the decoder output 395 and the raw input data 505 isinversely related to the accuracy of the prediction of future inputdata. For a scalar coding scheme, the prediction accuracy module 1600produces a value representing a difference between the decoder output395 and the raw input data 505 as the comparison result 1604.

When the decoder output 395 represents a range of predicted values, theprediction accuracy module 1600 can generate a value representing therange (e.g., a median value or an average value) for comparison with theraw input data 505.

In one embodiment, the prediction accuracy module 1600 receives morethan one decoder output 395 and corresponding raw input data 505simultaneously, and performs multiple comparisons simultaneously.

In one embodiment, the prediction score module 2030 outputs theperformance data 525 for more than one coding scheme. For example, theprediction score module 2030 outputs the prediction scores for two ormore coding schemes based on a single comparison by the predictionaccuracy module 1600, or outputs the prediction scores for two or morecoding schemes based on running averages of the prediction accuracy forthe two or more coding schemes.

FIG. 17 is a flowchart illustrating a process of evaluating theperformance of a STMS, according to one embodiment. The performanceevaluator 520 receives 1720 the decoder output 395 and the raw inputdata 505. The performance evaluator 520 then compares 1730 the decoderoutput 395 and the raw input data 505. Based on the comparison results,the performance evaluator 520 generates 1740 the performance data 525.The process of generating the performance data 525 may include, amongother steps, the averaging and the normalizing of values representingthe comparison results.

Upon reading this disclosure, those of skill in the art will appreciatestill additional alternative designs for processing nodes. Thus, whileparticular embodiments and applications have been illustrated anddescribed, it is to be understood that the invention is not limited tothe precise construction and components disclosed herein and thatvarious modifications, changes and variations which will be apparent tothose skilled in the art may be made in the arrangement, operation anddetails of the method and apparatus disclosed herein without departingfrom the spirit and scope of the present

What is claimed is:
 1. A method of searching for spatial patterns ortemporal sequences of spatial patterns in input data, comprising:configuring each of a plurality of spatial and temporal memory systems,each spatial and temporal memory system configured to encode a firstsubset of the input data based on a first encoder configuration togenerate encoded data; identifying, by each of the spatial and temporalmemory systems, spatial patterns or temporal sequences of spatialpatterns within the encoded data; evaluating the predictive performanceof each of the spatial and temporal memory systems based on theidentified spatial patterns or temporal sequences of spatial patterns;and responsive to one or more of the spatial and temporal memory systemsfailing to satisfy one or more predetermined predictive performancecriteria, re-configuring the one or more spatial and temporal memorysystems to encode a second subset of the input data based on a secondencoder configuration.
 2. The method of claim 1, wherein each of thespatial and temporal memory systems is further configured to timeaggregate a corresponding subset of the input data before encoding thesubset of input data.
 3. The method of claim 1, wherein each of thespatial and temporal memory systems is further configured to: analyze acorresponding subset of the input data before encoding the subset ofinput to determine at least one of: the input data types, thedistribution of input data values, and the range of input data values;and encode the subset of the input data based on the analysis.
 4. Themethod of claim 1, wherein each of the spatial and temporal memorysystems is configured based on at least one of: input data previouslyprovided to each of the spatial and temporal memory systems, a previousconfiguration of each of the spatial and temporal memory systems,analysis of the input data, and user-selected parameters.
 5. The methodof claim 1, wherein evaluating the predictive performance of a spatialand temporal memory system comprises determining a predicted spatialpattern based on an output of the spatial and temporal memory system,the output generated based on the spatial patterns or temporal sequencesof spatial patterns identified at the spatial and temporal memorysystem.
 6. The method of claim 1, wherein at least one predeterminedpredictive performance criteria comprises a threshold level ofpredictive accuracy of a spatial and temporal memory system inidentifying spatial patterns or temporal sequences of spatial patternswithin the encoded data.
 7. The method of claim 1, further comprises:identifying, by each re-configured spatial and temporal memory system,spatial patterns or temporal sequences of spatial patterns within thesecond subset of encoded input data; evaluating the predictiveperformance of each re-configured spatial and temporal memory systembased on the identified spatial patterns or temporal sequences ofspatial patterns within the second subset of encoded input data; andresponsive to one or more of the re-configured spatial and temporalmemory systems failing to satisfy one or more predetermined predictiveperformance criteria, configuring the one or more of the re-configuredspatial and temporal memory systems to encode a third subset of theinput data based on a third encoder configuration.
 8. A system forsearching for spatial patterns or temporal sequences of spatial patternsin input data, comprising: a non-transitory computer-readable storagemedium storing executable computer instructions configured to, whenexecuted, perform steps comprising: configuring each of a plurality ofspatial and temporal memory systems, each spatial and temporal memorysystem configured to encode a first subset of the input data based on afirst encoder configuration to generate encoded data; identifying, byeach of the spatial and temporal memory systems, spatial patterns ortemporal sequences of spatial patterns within the encoded data;evaluating the predictive performance of each of the spatial andtemporal memory systems based on the identified spatial patterns ortemporal sequences of spatial patterns; and responsive to one or more ofthe spatial and temporal memory systems failing to satisfy one or morepredetermined predictive performance criteria, re-configuring the one ormore spatial and temporal memory systems to encode a second subset ofthe input data based on a second encoder configuration; and a processorconfigured to execute the instructions.
 9. The system of claim 8,wherein each of the spatial and temporal memory systems is furtherconfigured to time aggregate a corresponding subset of the input databefore encoding the subset of input data.
 10. The system of claim 8,wherein each of the spatial and temporal memory systems is furtherconfigured to: analyze a corresponding subset of the input data beforeencoding the subset of input to determine at least one of: the inputdata types, the distribution of input data values, and the range ofinput data values; and encode the subset of the input data based on theanalysis.
 11. The system of claim 8, wherein each of the spatial andtemporal memory systems is configured based on at least one of: inputdata previously provided to each of the spatial and temporal memorysystems, a previous configuration of each of the spatial and temporalmemory systems, analysis of the input data, and user-selectedparameters.
 12. The system of claim 8, wherein evaluating the predictiveperformance of a spatial and temporal memory system comprisesdetermining a predicted spatial pattern based on an output of thespatial and temporal memory system, the output generated based on thespatial patterns or temporal sequences of spatial patterns identified atthe spatial and temporal memory system.
 13. The system of claim 8,wherein at least one predetermined predictive performance criteriacomprises a threshold level of predictive accuracy of a spatial andtemporal memory system in identifying spatial patterns or temporalsequences of spatial patterns within the encoded data.
 14. The system ofclaim 8, wherein the instructions are configured to, when executed,perform further steps comprising: identifying, by each re-configuredspatial and temporal memory system, spatial patterns or temporalsequences of spatial patterns within the second subset of encoded inputdata; evaluating the predictive performance of each re-configuredspatial and temporal memory system based on the identified spatialpatterns or temporal sequences of spatial patterns within the secondsubset of encoded input data; and responsive to one or more of there-configured spatial and temporal memory systems failing to satisfy oneor more predetermined predictive performance criteria, configuring theone or more of the re-configured spatial and temporal memory systems toencode a third subset of the input data based on a third encoderconfiguration.
 15. A non-transitory computer-readable storage mediumstoring executable computer program instructions for searching forspatial patterns or temporal sequences of spatial patterns in inputdata, the instructions comprising instructions for: configuring each ofa plurality of spatial and temporal memory systems, each spatial andtemporal memory system configured to encode a first subset of the inputdata based on a first encoder configuration to generate encoded data;identifying, by each of the spatial and temporal memory systems, spatialpatterns or temporal sequences of spatial patterns within the encodeddata; evaluating the predictive performance of each of the spatial andtemporal memory systems based on the identified spatial patterns ortemporal sequences of spatial patterns; and responsive to one or more ofthe spatial and temporal memory systems failing to satisfy one or morepredetermined predictive performance criteria, re-configuring the one ormore spatial and temporal memory systems to encode a second subset ofthe input data based on a second encoder configuration.
 16. Thenon-transitory computer-readable storage medium of claim 15, whereineach of the spatial and temporal memory systems is further configured totime aggregate a corresponding subset of the input data before encodingthe subset of input data.
 17. The non-transitory computer-readablestorage medium of claim 15, wherein each of the spatial and temporalmemory systems is further configured to: analyze a corresponding subsetof the input data before encoding the subset of input to determine atleast one of: the input data types, the distribution of input datavalues, and the range of input data values; and encode the subset of theinput data based on the analysis.
 18. The non-transitorycomputer-readable storage medium of claim 15, wherein each of thespatial and temporal memory systems is configured based on at least oneof: input data previously provided to each of the spatial and temporalmemory systems, a previous configuration of each of the spatial andtemporal memory systems, analysis of the input data, and user-selectedparameters.
 19. The non-transitory computer-readable storage medium ofclaim 15, wherein evaluating the predictive performance of a spatial andtemporal memory system comprises determining a predicted spatial patternbased on an output of the spatial and temporal memory system, the outputgenerated based on the spatial patterns or temporal sequences of spatialpatterns identified at the spatial and temporal memory system.
 20. Thenon-transitory computer-readable storage medium of claim 15, wherein atleast one predetermined predictive performance criteria comprises athreshold level of predictive accuracy of a spatial and temporal memorysystem in identifying spatial patterns or temporal sequences of spatialpatterns within the encoded data.